Parametric Analysis of Queuing Networks
ثبت نشده
چکیده
We consider a queuing network with M exponential service stations and with N customers. We study the behavior of a subsystem u, which has a single node as input and a single node as output, when the subsystem parameters are varied. An “equivalent” network is constructed in which all queues except those in subsystem u are replaced by a single composite queue. We show that for certain classes of system parameters, the behavior of subsystem u in the equivalent network is the same as in the given network. The analogy to Norton’s theorem in electrical circuit theory is demonstrated. In addition, the equivalent network analysis can be applied to open exponential networks. Introduction Queuing models are widely used to analyze and design a variety of systems. These models are generally used to study the variation of certain system parameters such as response time as a function of the network structure and service times. In this paper, the authors determine a relationship that exists between some queuing networks and electrical networks, with customers and throughput (rate of flow of customers) being analogous to electrical charge and electrical current, respectively. The authors show how to directly apply some methods from electrical circuit theory, in particular Norton’s theorem [ 11, to queuing networks. Consider an electrical circuit consisting of batteries and resistors, Fig. 1 . To study the behavior of a subsystem u between terminals 1 and 2 of Fig. 1 as the subsystem parameters are varied, construct an “equivalent” circuit in which all the components of the given circuit, except those of subsystem u, are replaced by a single current source and a parallel internal resistance, Fig. 2. The value of the current source is set equal to the current flowing between terminals 1 and 2 when subsystem u Figure 1 Electrical network.
منابع مشابه
MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملA Parametric Decomposition Based Approach for Multi-class Closed Queuing Networks with Synchronization Stations
Multi-class closed queuing networks with synchronization stations find applications in analytical models of assembly systems and production systems operating under pull control policies. These queuing networks are hard to analyze exactly and therefore approximation methods must be used for performance evaluation. In this research we propose a new efficient approach based on parametric decomposi...
متن کاملDesign and Implementation of Priority Queuing Mechanism on FPGA Using Concurrent Periodic EFSMs and Parametric Model Checking
In this paper, we propose a design and implementation method for priority queuing mechanisms on FPGAs. First, we describe behavior of WFQ (weighted fair queuing) with several parameters in a model called concurrent periodic EFSMs. Then, we derive a parameter condition for the concurrent EFSMs to execute their transitions without deadlocks in the specified time period repeatedly under the specif...
متن کامل